Compositions and Convex Combinations of Averaged Nonexpansive Operators
نویسندگان
چکیده
Properties of compositions and convex combinations of averaged nonexpansive operators are investigated and applied to the design of new fixed point algorithms in Hilbert spaces. An extended version of the forward-backward splitting algorithm for finding a zero of the sum of two monotone operators is obtained.
منابع مشابه
Asymptotic behavior of compositions of under-relaxed nonexpansive operators
In general there exists no relationship between the fixed point sets of the composition and of the average of a family of nonexpansive operators in Hilbert spaces. In this paper, we establish an asymptotic principle connecting the cycles generated by under-relaxed compositions of nonexpansive operators to the fixed points of the average of these operators. In the special case when the operators...
متن کاملSolving Monotone Inclusions via Compositions of Nonexpansive Averaged Operators
A unified fixed point theoretic framework is proposed to investigate the asymptotic behavior of algorithms for finding solutions to monotone inclusion problems. The basic iterative scheme under consideration involves nonstationary compositions of perturbed averaged nonexpansive operators. The analysis covers proximal methods for common zero problems as well as various splitting methods for find...
متن کاملNear equality, near convexity, sums of maximally monotone operators, and averages of firmly nonexpansive mappings
We study nearly equal and nearly convex sets, ranges of maximally monotone operators, and ranges and fixed points of convex combinations of firmly nonexpansive mappings. The main result states that the range of an average of firmly nonexpansive mappings is nearly equal to the average of the ranges of the mappings. A striking application of this result yields that the average of asymptotically r...
متن کاملStochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping
This work proposes block-coordinate fixed point algorithms with applications to nonlinear analysis and optimization in Hilbert spaces. The asymptotic analysis relies on a notion of stochastic quasiFejér monotonicity, which is thoroughly investigated. The iterative methods under consideration feature random sweeping rules to select arbitrarily the blocks of variables that are activated over the ...
متن کاملNew Douglas-Rachford Algorithmic Structures and Their Convergence Analyses
In this paper we study new algorithmic structures with DouglasRachford (DR) operators to solve convex feasibility problems. We propose to embed the basic two-set-DR algorithmic operator into the String-Averaging Projections (SAP) and into the Block-Iterative Projection (BIP) algorithmic structures, thereby creating new DR algorithmic schemes that include the recently proposed cyclic DouglasRach...
متن کامل